Some Turing-Complete Extensions of First-Order Logic
نویسنده
چکیده
We introduce a natural Turing-complete extension of first-order logic FO. The extension adds two novel features to FO. The first one of these is the capacity to add new points to models and new tuples to relations. The second one is the possibility of recursive looping when a formula is evaluated using a semantic game. We first define a game-theoretic semantics for the logic and then prove that the expressive power of the logic corresponds in a canonical way to the recognition capacity of Turing machines. Finally, we show how to incorporate generalized quantifiers into the logic and argue for a highly natural connection between oracles and generalized quantifiers.
منابع مشابه
On the compactness property of extensions of first-order G"{o}del logic
We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...
متن کاملStatistical Relational Artificial Intelligence: Logic, Probability, and Computation
An intelligent agent interacting with the real world will encounter individual people, courses, test results, drugs prescriptions, chairs, boxes, etc., and needs to reason about properties of these individuals and relations among them as well as cope with uncertainty. Uncertainty has been studied in probability theory and graphical models, and relations have been studied in logic, in particular...
متن کاملOne-point extensions of locally compact paracompact spaces
A space $Y$ is called an {em extension} of a space $X$, if $Y$ contains $X$ as a dense subspace. Two extensions of $X$ are said to be {em equivalent}, if there is a homeomorphism between them which fixes $X$ point-wise. For two (equivalence classes of) extensions $Y$ and $Y'$ of $X$ let $Yleq Y'$, if there is a continuous function of $Y'$ into $Y$ which fixes $X$ point-wise. An extension $Y$ ...
متن کاملRelative Interpretations in Constructive Arithmetic
In this paper, we show that the predicate logics of consistent extensions of Heyting’s Arithmetic plus Church’s Thesis with uniqueness condition are complete Π2. Similarly, we show that the predicate logic of HA ∗, i.e. Heyting’s Arithmetic plus the Completeness Principle (for HA∗) is complete Π2. These results extend the known results due to Valery Plisko. To prove the results we adapt Plisko’...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کامل